Some Open Questions Related to Cuckoo Hashing
نویسنده
چکیده
The purpose of this brief note is to describe recent work in the area of cuckoo hashing, including a clear description of several open problems, with the hope of spurring further research.
منابع مشابه
Cuckoo Hashing with Pages
Although cuckoo hashing has significant applications in both theoretical and practical settings, a relevant downside is that it requires lookups to multiple locations. In many settings, where lookups are expensive, cuckoo hashing becomes a less compelling alternative. One such standard setting is when memory is arranged in large pages, and a major cost is the number of page accesses. We propose...
متن کاملOn the insertion time of random walk cuckoo hashing
Cuckoo Hashing is a hashing scheme invented by Pagh and Rodler [9]. It uses d ≥ 2 distinct hash functions to insert items into the has table. It has been an open question for some time as to the expected time for Random Walk Insertion to add items. We show that if the number of hash functions d = O(1) is sufficiently large, then the expected insertion time is O(1) per item.
متن کاملAn Improved Version of Cuckoo Hashing: Average Case Analysis of Construction Cost and Search Operations
Cuckoo hashing is a hash table data structure introduced in [1], that offers constant worst case search time. As a major contribution of this paper, we analyse modified versions of this algorithm with improved performance. Further, we provide an asymptotic analysis of the search costs of all this variants of cuckoo hashing and compare this results with the well known properties of double hashin...
متن کاملOn risks of using a high performance hashing scheme with common universal classes
The contribution of this thesis is a mathematical analysis a high performance hashing scheme called cuckoo hashing when combined with two very simple and efficient classes of functions that we refer to as the multiplicative class and the linear class, respectively. We prove that cuckoo hashing tends to work badly with these classes. In order to show this, we investigate how the inner structure ...
متن کاملAn Overview of Cuckoo Hashing
Cuckoo Hashing is a technique for resolving collisions in hash tables that produces a dictionary with constant-time worst-case lookup and deletion operations as well as amortized constant-time insertion operations. First introduced by Pagh in 2001 [3] as an extension of a previous static dictionary data structure, Cuckoo Hashing was the first such hash table with practically small constant fact...
متن کامل